منابع مشابه
Graphs with smallest forgotten index
The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all trees, the first through the third smallest forgotten indices among all connected graph with cyclomatic number $gamma=1,2$, the first through<br /...
متن کاملTurán Graphs, Stability Number, and Fibonacci Index
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the stability number and the order of general graphs and connected graphs. Turán graphs frequently appear in extremal graph theory. We show that Turán graphs and a conne...
متن کاملFibonacci Index and Stability Number of Graphs: a Polyhedral Study
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the stability number and the order of general graphs and connected graphs. Turán graphs frequently appear in extremal graph theory. We show that Turán graphs and a conne...
متن کاملStability of One Bay Symmetrical Frames with Nonuniform Members
This paper deals with simple portal or gable steel frames with varying moment of inertia. Critical load for such frames is calculated by means of a very simple and approximate method through which the variation of moment of inertia for the members is considered by a quadratic function and then the equilibrium and continuity conditions have been used. The degree of precision of this method has b...
متن کاملGraphs with Extremal Connectivity Index
Let G be a graph and δv the degree of its vertex v . The connectivity index of G is χ = ∑ (δu δv) −1/2 , with the summation ranging over all pairs of adjacent vertices of G . We offer a simple proof that (a) among n-vertex graphs without isolated vertices, the star has minimal χvalue, and (b) among n-vertex graphs, the graphs in which all components are regular of non–zero degree have maximal (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 1976
ISSN: 1446-7887,1446-8107
DOI: 10.1017/s1446788700015329